Shape (Self-)Similarity and Dissimilarity Rating for Segmentation and Matching
نویسندگان
چکیده
Similarities and dissimilarities can be found in many natural as well as man-made structures and are an important source of information, e.g., for isolating defects or pathological regions, and for finding unique points and regions of interest on surfaces. This paper introduces a new approach for computing similarity information that can be used, e.g., for surface segmentation or to guide a subsequent registration. The method is based on a probabilistic matching algorithm generating possible partial matches between shapes. For each point of a source surface we analyse the distribution of similar regions on a reference surface. In this way, we obtain a point-wise similarity rating between the source and reference shape. In our experimental evaluation we demonstrate the usability and show some excellent results on several 3D objects, like industrial CAD data sets, bone fractures, and potteries.
منابع مشابه
Structure-oriented contour representation and matching for engineering shapes
Conventional shape matching for engineering models primarily considers rigid shape similarity. They do not seek global shape similarity while considering large local deformations. However, engineering models created by some parametric-based design can involve large parametric changes. As a result, they do not share similarity in their global shape. Hence our goal is to develop shape representat...
متن کاملRepresentation and Self-Similarity of Shapes
Representing shapes is a signi cant problem for vi sion systems that must recognize or classify objects We derive a representation for a given shape by inves tigating its self similarities and constructing its shape axis SA and shape axis tree SA tree We start with a shape its boundary contour and two di erent parameterizations for the contour To measure its self similarity we consider matching...
متن کاملDissimilarity between two skeletal trees in a context
Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly, tree edit distance is used to compute a dissimilarity between two given shapes. We present a new tree edit based shape matching method which uses a recent coarse skeleton representation. The coarse skeleton representation allows us to represent both shapes and shape categories in the form of dep...
متن کاملContext-dependent segmentation and matching in image databases
The content of an image can be summarized by a set of homogeneous regions in an appropriate feature space. When exact shape is not important, the regions can be represented by simple “blobs”. Even for similar images, the blob representation of the two images might vary in shape, position, the number of blobs, and the represented features. In addition, separate blobs in one image might correspon...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012